Near-Optimal Resource Allocation in Cooperative Cellular Networks Using Genetic Algorithms

This paper shows how a genetic algorithm can be used as a method of obtaining the near-optimal solution of the resource block scheduling problem in a cooperative cellular network. An exhaustive search is initially implemented to guarantee that the optimal result, in terms of maximizing the bandwidth efficiency of the overall network, is found, and then the genetic algorithm with the properly selected termination conditions is used in the same network. The simulation results show that the genetic algorithm can approximately achieve the optimum bandwidth efficiency whilst requiring only 24% of the computation effort of the exhaustive search in the investigated network.